/* Copyright (c) 2006 by M Aamir Maniar 
 * 
 * Permission is hereby granted, free of charge, to any person obtaining 
 * a copy of this software and associated documentation files (the 
 * "Software"), to deal in the Software without restriction, including 
 * without limitation the rights to use, copy, modify, merge, publish, 
 * distribute, sublicense, and/or sell copies of the Software, and to 
 * permit persons to whom the Software is furnished to do so, subject to 
 * the following conditions:
 * 
 * The above copyright notice and this permission notice shall be 
 * included in all copies or substantial portions of the Software.
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 * 
 * */

namespace Generic.Algorithms.Sorting
{
	using System;
	using System.Collections.Generic;
	using System.Text;

	public class SelectSort<T> : SortStrategy<T>
		where T : IComparable
	{

        public SelectSort()
        {
        }

		/// <summary>
		/// Initializes a new instance of the <see cref="T:SelectSort&lt;T&gt;"/> class.
		/// </summary>
		/// <param name="listToSort">The list to sort.</param>
		public SelectSort(IList<T> list) : base(list)
		{
		}

		/// <summary>
		/// Sorts the specified list by SelectSort alogorightm.
		/// </summary>
		/// <param name="sortDirection">The sort direction.</param>
		public override void Sort(SortDirection sortDirection)
		{
            base.Sort(sortDirection);

			int outer, inner;
			bool descending = (sortDirection == SortDirection.Descending) ? true : false;

			for (outer=0; outer<List.Count-1; outer++)
			{
				for (inner=outer+1; inner<List.Count; inner++)
				{
					if ((CompareTo( List[inner], List[outer]) < 0)^descending)
					{
						Swap(outer, inner);
					}
				}
			}
		}
	}
}
